On the intractability of permuting a block code to minimize trellis complexity
نویسندگان
چکیده
| An important problem in the theory and application of block code trellises is to nd a coordinate permutation of a given code to minimize the trellis complexity. In this paper we show that the problem of nding a coordinate permutation that minimizes the number of vertices at a given depth in the minimal trellis for a binary linear block code is NP-complete.
منابع مشابه
On the Intractability of Permuting a Block Code to Minimize Trellis Complexity [Correspondence] - Information Theory, IEEE Transactions on
A novel trellis design technique for both block and convolutional codes based on the Shannon product of component block codes is introduced. Using the proposed technique, structured trellises for block and convolutional codes have been designed. It is shown that the designed trellises are minimal and allow reduced complexity Viterbi decoding. Zndex Terms-Linear codes, trellis structure, product...
متن کاملThe "Art of Trellis Decoding" Is NP-Hard
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C ′ whose minimal trellis has the least state-complexity among all codes obtainable by permuting the coordinates of C. By reducing from the problem of computing the pathwidth of a graph, we show that the problem of finding such a coordinate permutation is NP-hard, thus ...
متن کاملA Heuristic for Ordering a Linear Block Code to Minimize Trellis State Complexity
| An important problem in the theory and application of block code trellises is to nd a coordinate permutation for a given code that minimizes the trellis state complexity. In this paper we show that the problem of minimizing a given component of the state complexity proole is NP-complete. We describe an algorithm, though not guaranteed to nd an optimal coordinate ordering, uses a heuristic des...
متن کاملAn Efficient Informed Embedding Scheme Using Systematic Nested Block Codes over Gaussian Channel
We present a high-capacity informed embedding scheme based on a trellis structure for a nested linear block code. This scheme can embed adaptive robust watermarked messages for various applications. Instead of using randomly generated reference vectors as arc labels, this scheme uses the codewords of a nested block code to label the arcs in the trellis structure so that each codeword can carry ...
متن کاملTrellis decoding complexity of linear block codes
AbstructIn this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimensiodlength profile (DLP) bounds. Codes meeting these bounds minimize all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 1996